Approximate Information Filtering in Peer-to-Peer Networks
Identifieur interne : 000767 ( Main/Exploration ); précédent : 000766; suivant : 000768Approximate Information Filtering in Peer-to-Peer Networks
Auteurs : Christian Zimmer [Allemagne] ; Christos Tryfonopoulos [Allemagne] ; Klaus Berberich [Allemagne] ; Manolis Koubarakis [Grèce] ; Gerhard Weikum [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2008.
English descriptors
- Teeft :
- Approximate information, Baseline approach, Catchg, Centralized system, Continuous queries, Continuous query, Data sources, Database, Different publishing scenarios, Different topics, Digital libraries, Distinct terms, Document, Document collection, Document publications, Exact information, Experimental evaluation, Future publishing activity, Important observation, Inactivity periods, Information producer, Information retrieval, Load balancing, Local query database, Ltering, Ltering approaches, Maintenance messages, Maps protocols, Message cost, News items, Node, Node behavior, Node behavior prediction, Node score, Node selection, Node selection strategy, Nodes publishing documents, Olympic games, Other hand, Overall number, Overlay networks, Potential sources, Prediction mechanism, Prediction methods, Protocol, Publication prediction, Publication time, Publisher node, Publishing documents, Query, Query terms, Rand, Ranking function, Ranking method, Ranking methods, Relevant documents, Resource selection, Retrieval, Scenario, Scenario rand benefit cost ratio, Subscriber, Subscriber node, Subscription messages, Subscription protocol, Tats message, Time series, Time series analysis, Tmpchg, Tmpchg scenario, Topic authorities, Total number, User query, Zimmer.
Abstract
Abstract: Most approaches to information filtering taken so far have the underlying hypothesis of potentially delivering notifications from every information producer to subscribers. This exact publish/subscribe model creates an efficiency and scalability bottleneck, and might not even be desirable in certain applications. The work presented here puts forward MAPS, a novel approach to support approximate information filtering in a peer-to-peer environment. In MAPS a user subscribes to and monitors only carefully selected data sources, and receives notifications about interesting events from these sources only. This way scalability is enhanced by trading recall for lower message traffic. We define the protocols of a peer-to-peer architecture especially designed for approximate information filtering, and introduce new node selection strategies based on time series analysis techniques to improve data source selection. Our experimental evaluation shows that MAPS is scalable; it achieves high recall by monitoring only few data sources.
Url:
DOI: 10.1007/978-3-540-85481-4_3
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000B41
- to stream Istex, to step Curation: 000A85
- to stream Istex, to step Checkpoint: 000591
- to stream Main, to step Merge: 000767
- to stream Main, to step Curation: 000767
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Approximate Information Filtering in Peer-to-Peer Networks</title><author><name sortKey="Zimmer, Christian" sort="Zimmer, Christian" uniqKey="Zimmer C" first="Christian" last="Zimmer">Christian Zimmer</name></author><author><name sortKey="Tryfonopoulos, Christos" sort="Tryfonopoulos, Christos" uniqKey="Tryfonopoulos C" first="Christos" last="Tryfonopoulos">Christos Tryfonopoulos</name></author><author><name sortKey="Berberich, Klaus" sort="Berberich, Klaus" uniqKey="Berberich K" first="Klaus" last="Berberich">Klaus Berberich</name></author><author><name sortKey="Koubarakis, Manolis" sort="Koubarakis, Manolis" uniqKey="Koubarakis M" first="Manolis" last="Koubarakis">Manolis Koubarakis</name></author><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:6C94997F67D3C6E499EFB0CFF88A2416015BC52E</idno><date when="2008" year="2008">2008</date><idno type="doi">10.1007/978-3-540-85481-4_3</idno><idno type="url">https://api.istex.fr/document/6C94997F67D3C6E499EFB0CFF88A2416015BC52E/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000B41</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000B41</idno><idno type="wicri:Area/Istex/Curation">000A85</idno><idno type="wicri:Area/Istex/Checkpoint">000591</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000591</idno><idno type="wicri:doubleKey">0302-9743:2008:Zimmer C:approximate:information:filtering</idno><idno type="wicri:Area/Main/Merge">000767</idno><idno type="wicri:Area/Main/Curation">000767</idno><idno type="wicri:Area/Main/Exploration">000767</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Approximate Information Filtering in Peer-to-Peer Networks</title><author><name sortKey="Zimmer, Christian" sort="Zimmer, Christian" uniqKey="Zimmer C" first="Christian" last="Zimmer">Christian Zimmer</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Max-Planck-Institute for Informatics, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Tryfonopoulos, Christos" sort="Tryfonopoulos, Christos" uniqKey="Tryfonopoulos C" first="Christos" last="Tryfonopoulos">Christos Tryfonopoulos</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Max-Planck-Institute for Informatics, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Berberich, Klaus" sort="Berberich, Klaus" uniqKey="Berberich K" first="Klaus" last="Berberich">Klaus Berberich</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Max-Planck-Institute for Informatics, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Koubarakis, Manolis" sort="Koubarakis, Manolis" uniqKey="Koubarakis M" first="Manolis" last="Koubarakis">Manolis Koubarakis</name><affiliation wicri:level="1"><country xml:lang="fr">Grèce</country><wicri:regionArea>National and Kapodistrian University of Athens</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Grèce</country></affiliation></author><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Max-Planck-Institute for Informatics, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2008</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Approximate information</term><term>Baseline approach</term><term>Catchg</term><term>Centralized system</term><term>Continuous queries</term><term>Continuous query</term><term>Data sources</term><term>Database</term><term>Different publishing scenarios</term><term>Different topics</term><term>Digital libraries</term><term>Distinct terms</term><term>Document</term><term>Document collection</term><term>Document publications</term><term>Exact information</term><term>Experimental evaluation</term><term>Future publishing activity</term><term>Important observation</term><term>Inactivity periods</term><term>Information producer</term><term>Information retrieval</term><term>Load balancing</term><term>Local query database</term><term>Ltering</term><term>Ltering approaches</term><term>Maintenance messages</term><term>Maps protocols</term><term>Message cost</term><term>News items</term><term>Node</term><term>Node behavior</term><term>Node behavior prediction</term><term>Node score</term><term>Node selection</term><term>Node selection strategy</term><term>Nodes publishing documents</term><term>Olympic games</term><term>Other hand</term><term>Overall number</term><term>Overlay networks</term><term>Potential sources</term><term>Prediction mechanism</term><term>Prediction methods</term><term>Protocol</term><term>Publication prediction</term><term>Publication time</term><term>Publisher node</term><term>Publishing documents</term><term>Query</term><term>Query terms</term><term>Rand</term><term>Ranking function</term><term>Ranking method</term><term>Ranking methods</term><term>Relevant documents</term><term>Resource selection</term><term>Retrieval</term><term>Scenario</term><term>Scenario rand benefit cost ratio</term><term>Subscriber</term><term>Subscriber node</term><term>Subscription messages</term><term>Subscription protocol</term><term>Tats message</term><term>Time series</term><term>Time series analysis</term><term>Tmpchg</term><term>Tmpchg scenario</term><term>Topic authorities</term><term>Total number</term><term>User query</term><term>Zimmer</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Most approaches to information filtering taken so far have the underlying hypothesis of potentially delivering notifications from every information producer to subscribers. This exact publish/subscribe model creates an efficiency and scalability bottleneck, and might not even be desirable in certain applications. The work presented here puts forward MAPS, a novel approach to support approximate information filtering in a peer-to-peer environment. In MAPS a user subscribes to and monitors only carefully selected data sources, and receives notifications about interesting events from these sources only. This way scalability is enhanced by trading recall for lower message traffic. We define the protocols of a peer-to-peer architecture especially designed for approximate information filtering, and introduce new node selection strategies based on time series analysis techniques to improve data source selection. Our experimental evaluation shows that MAPS is scalable; it achieves high recall by monitoring only few data sources.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Grèce</li></country><region><li>Sarre (Land)</li></region><settlement><li>Sarrebruck</li></settlement></list><tree><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Zimmer, Christian" sort="Zimmer, Christian" uniqKey="Zimmer C" first="Christian" last="Zimmer">Christian Zimmer</name></region><name sortKey="Berberich, Klaus" sort="Berberich, Klaus" uniqKey="Berberich K" first="Klaus" last="Berberich">Klaus Berberich</name><name sortKey="Berberich, Klaus" sort="Berberich, Klaus" uniqKey="Berberich K" first="Klaus" last="Berberich">Klaus Berberich</name><name sortKey="Tryfonopoulos, Christos" sort="Tryfonopoulos, Christos" uniqKey="Tryfonopoulos C" first="Christos" last="Tryfonopoulos">Christos Tryfonopoulos</name><name sortKey="Tryfonopoulos, Christos" sort="Tryfonopoulos, Christos" uniqKey="Tryfonopoulos C" first="Christos" last="Tryfonopoulos">Christos Tryfonopoulos</name><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><name sortKey="Zimmer, Christian" sort="Zimmer, Christian" uniqKey="Zimmer C" first="Christian" last="Zimmer">Christian Zimmer</name></country><country name="Grèce"><noRegion><name sortKey="Koubarakis, Manolis" sort="Koubarakis, Manolis" uniqKey="Koubarakis M" first="Manolis" last="Koubarakis">Manolis Koubarakis</name></noRegion><name sortKey="Koubarakis, Manolis" sort="Koubarakis, Manolis" uniqKey="Koubarakis M" first="Manolis" last="Koubarakis">Manolis Koubarakis</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000767 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000767 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:6C94997F67D3C6E499EFB0CFF88A2416015BC52E
|texte= Approximate Information Filtering in Peer-to-Peer Networks
}}
| This area was generated with Dilib version V0.6.33. |  |